翻訳と辞書 Words near each other ・ Non-Klinefelter XXY ・ Non-Langerhans cell histiocytosis ・ Non-League Day ・ Non-League football ・ Non-lethal weapon ・ Non-lexical vocables in music ・ Non-Life Master Swiss Teams ・ Non-lifting sign ・ Non-line-of-sight propagation ・ Non-linear coherent states ・ Non-linear editing system ・ Non-linear effects ・ Non-linear iterative partial least squares ・ Non-linear least squares ・ Non-linear multi-dimensional signal processing ・ Non-Linear Preferential Attachment ・ Non-linear sigma model ・ Non-Linear Systems ・ Non-local means ・ Non-local variable ・ Non-lock concurrency control ・ Non-logical symbol ・ Non-Manufacturing Business Activity Index ・ Non-Manufacturing ISM Report on Business ・ Non-maskable interrupt ・ Non-material culture ・ Non-measurable set ・ Non-Mendelian inheritance ・ Non-metallic inclusions ・ Non-methane volatile organic compound Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Non-Linear Preferential Attachment ： ウィキペディア英語版 Non-Linear Preferential Attachment In network science preferential attachment means that nodes tend to connect to those nodes which have more links. If the network is growing and new nodes tend to connect to existing ones with linear probability in the degree of the existing nodes then preferential attachment leads to a scale-free network. If this probability is sub-linear then the network’s degree distribution is stretched exponential and hubs are much smaller than in a scale-free network. If this probability is super-linear then almost all nodes are connected to a few hubs. According to Kunegis, Blattner and Moser several online networks follow non-linear preferential attachment model. Communication networks and online contact networks are sub-linear while interaction networks are super-linear. The co-author network among scientists also shows the signs of sub-linear preferential attachment. == Types of preferential attachment == For simplicity it can be assumed that the probability with which a new node connects to an existing one follows a power function of the existing nodes’ degree (k): π(k) ~ kα where α>0. This is a good approximation for a lot of real networks such as the Internet, the citation network or the actor network. If α=1 then the preferential attachment is linear. If α<1 then it is sub-linear while if α>1 then it is super-linear. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Non-Linear Preferential Attachment」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.